Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine
نویسندگان
چکیده
منابع مشابه
Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine
A batch machine is a machine that can process a number of jobs simultaneously as a batch, and the processing time of a batch is equal to the longest processing time of the jobs assigned to it. In this paper we present a polynomial time approximation scheme (PTAS) for scheduling a batch machine to minimize the total completion time with job release dates. Also, we present a fully polynomial time...
متن کاملApproximation Schemes for Minimizing Average Weighted Completion Time with Release Dates
We consider the problem of scheduling n jobs with release dates on m machines so as to minimize their average weighted completion time. We present the first known polynomial time approximation schemes for several variants of this problem. Our results include PTASs for the case of identical parallel machines and a constant number of unrelated machines with and without preemption allowed. Our sch...
متن کاملMinimizing Makespan and Total Completion Time Criteria on a Single Machine with Release Dates
1 Department of Computer Science University for Development Studies, Ghana 2 Department of Industrial and Production Engineering University of Ibadan, Nigeria Corresponding Author: E. O. Oyetunji _________________________________________________________________________________________________ Abstract This paper considers the scheduling problem of simultaneously minimizing the makespan and tota...
متن کاملMinimizing the total weighted completion time on a single machine scheduling with release dates and a learning effect
In this paper a single machine scheduling problem to minimize tardy jobs is considered. To increase the reality of the problem, deterioration and learning effect is added to. Beside, according to Inherent uncertainty in processing times, they are considered to be normally distributed. To find an appropriate solution, four existing models are extended and the results are compared to validate them.
متن کاملSingle .machine Total Weighted Tardiness with Release Dates Single Machine Total Weighted Tardiness with Release Dates
The single machine total weighted tardiness with release dates problem is known to be strongly NP-hard. With a new lower bounding scheme and a new upper bounding scheme, we get an efficient branch and bound algorithm. In the paper, we first introduce the history of the problem and its computational complexity. Second, the lower bounding schemes and the upper bounding schemes are described in de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2005
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2005.07.028